Computational problems in $S$-function theory

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Theory of Biological Function I

This series presents an approach to mathematical biology which makes precise the function of biological molecules. Because biological systems compute, the theory is a general purpose computer language. I build a language for efficiently representing the function of protein-like molecules in a cell. The first paper only presents the kinematic part of the formalism, but this is already useful for...

متن کامل

‏‎interpersonal function of language in subtitling

‏‎translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...

15 صفحه اول

Algorithmic, Geometric, and Combinatorial Problems in Computational Music Theory

Computational music theory offers a wide variety of interesting geometric, combinatoric, and algorithmic problems. Some of these problems are illustrated for the special cases of rhythm and melody. In particular, several techniques useful for the teaching, analysis, generation and automated recognition of the rhythmic components of music are reviewed. A new measure of rhythm-evenness is describ...

متن کامل

Meeting on Computational and Analytic Problems in Spectral Theory

In this talk I will discuss a method to prove the absence of critical points for the Helmholtz equation in 3D. The key element of the approach is the use of multiple frequencies in a fixed range, and the proof is based on the spectral analysis of the associated problem. This question is strictly connected with the Radó-Kneser-Choquet theorem, whose direct extension to the Helmholtz equation or ...

متن کامل

Computational Complexity of Fundamental Problems in Social Choice Theory

Computational social choice (comsoc) theory is currently an important area of research in computer science and more specifically in AI. The field started with the pioneering work of Bartholdi et al. in 1989 where they explored the the possibility of using computational intractability as a barrier against manipulation. Following that, a vast amount of research explored computational complexity o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1973

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1973-0338134-4